Distributed Algorithms in Mobile Ad Hoc Networks

A mobile adhoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consists of mobile nodes with wireless interfaces and has an arbitrary dynamic topology. The network suffers from frequent link formation and disruption due to the mobility of the nodes. Distributed algorithms cannot be directly used for the mobile adhoc networks due to the inherent mobility issues. These algorithms must be redesigned for mobile adhoc networks so that they are aware of the underlying mobility. In this report we discuss few algorithms for mutual exclusion and leader election in mobile adhoc networks.